A Method to Generate First Integrals from Infinitesimal Symmetries
نویسندگان
چکیده
منابع مشابه
Action Integrals and Infinitesimal Characters
Let G be a reductive Lie group and O the coadjoint orbit of a hyperbolic element of g. By π is denoted the unitary irreducible representation of G associated with O by the orbit method. We give geometric interpretations in terms of concepts related to O of the constant π(g), for g ∈ Z(G). In the spirit of the orbit method we interpret geometrically the infinitesimal character of the differentia...
متن کاملa paradigm shift away from method-wise teaching to strategy-wise teaching: an investigation of reconstructive strategy versus communicative strategy
چکیده: هدف اصلی این مطالعه ی توصیفی تحقیقی در حقیقت تلاشی پساروش-گرا به منظور رسیدن به نتیجه ای منطقی در انتخاب مناسبترین راهکار آموزشی بر گرفته از چارچوب راهبردی مطرح شده توسط والدمر مارتن بوده که به بهترین شکل سازگار و مناسب با سامانه ی آموزشی ایران باشد. از این رو، دو راهکار آموزشی، راهکار ارتباطی و راهکار بازساختی، برای تحقیق و بررسی انتخاب شدند. صریحاً اینکه، در راستای هدف اصلی این پژوهش، ر...
15 صفحه اولFirst Integrals/Invariants & Symmetries for Autonomous Difference Equations
For the autonomous kth order difference equation xn+k = f(xn, xn+1, . . . , xn+k−1), where f ∈ C[U ] with domain U ⊂ R, a global first integral/invariant for this difference equation is a nonconstant function H ∈ C[U ], with H : U → R, which remains invariant on the forward orbit Γ(x0, x1, . . . , xk−1). If a first integral exists, then it satisfies a particular functional difference equation a...
متن کاملLie Point Symmetries and First Integrals: the Kowalevsky Top
We show that Lie group analysis yields the first integrals admitted by any system of ordinary differential equations if the method developed by Nucci (J.) is applied. As an example, we obtain the famous first integral of the Kowalevsky top.
متن کاملReducing Symmetries to Generate Easier SAT Instances
Finding countermodels is an effective way of disproving false conjectures. In first-order predicate logic, model finding is an undecidable problem. But if a finite model exists, it can be found by exhaustive search. The finite model generation problem in the first-order logic can also be translated to the satisfiability problem in the propositional logic. But a direct translation may not be ver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mediterranean Journal of Mathematics
سال: 2014
ISSN: 1660-5446,1660-5454
DOI: 10.1007/s00009-014-0470-6